“School of Computer Science”

Back to Papers Home
Back to Papers of School of Computer Science

Paper   IPM / Computer Science / 11085
School of Computer Science
  Title:   Constraint-based performance comparison of multi-dimensional interconnection networks with deterministic and adaptive routing strategies
  Author(s):  H. Sarbazi-Azad
  Status:   Published
  Journal: Computers & Electrical Engineering
  No.:  3
  Vol.:  30
  Year:  2004
  Pages:   167-182
  Publisher(s):   Elsevier
  Supported by:  IPM
  Abstract:
Several studies have examined the relative performance merits of the torus and hypercube taking into account the channel bandwidth constraints imposed by implementation technology. While the torus has been shown to outperform the hypercube under the constant wiring density constraint, the opposite conclusion has been reached when the constant pin-out constraint is considered. However, all these studies have assumed deterministic routing and have not taken into account the internal hardware cost of routers. This paper re-examines the performance merits of the torus and hypercube using both fully-adaptive and deterministic routing strategies. Moreover, it uses a new cost model which takes into account the internal hardware cost of routers.

Download TeX format
back to top
scroll left or right